package com.njupt.DynamicProgramming;

/**
 * @Author: wujiaming
 * @CreateTime: 2025/1/7 21:01
 * @Description: 96. 不同的二叉搜索树
 * @Version: 1.0
 */


public class NumTrees_96 {

    public int numTrees(int n) {
        int[] dp = new int[n+1];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <=n ; i++) {
            for (int j = 1; j <=i ; j++) {

                dp[i] += dp[j-1] * dp[i-j];
            }
        }
        return dp[n];
    }

    public static void main(String[] args) {
        NumTrees_96 test = new NumTrees_96();

        System.out.println(test.numTrees(3));
    }
}
